Quasi-local algebras and asymptotic expanders
نویسندگان
چکیده
In this paper, we study the relation between uniform Roe algebra and quasi-local associated to a metric space of bounded geometry. process, introduce weakening notion expanders, called asymptotic expanders. We show that being sequence expanders is coarse property under certain connectedness condition, it implies non-uniformly local amenability. Moreover, also analyse some $C^*$-algebraic properties algebras. particular, nuclear if only underlying has Property A.
منابع مشابه
Quasi-local charges and asymptotic symmetry generators
The quasi-local formulation of conserved charges through the off-shell approach is extended to cover the asymptotic symmetry generators. By introducing identically conserved currents which are appropriate for asymptotic Killing vectors, we show that the asymptotic symmetry generators can be understood as quasi-local charges. We also show that this construction is completely consistent with the ...
متن کاملExpanders In Group Algebras
Let G be a finite group and let p be a prime such that (p, |G|) = 1. We study conditions under which the Abelian group Fp[G] has a few G-orbits whose union generate it as an expander (equivalently, all the discrete Fourier coefficients (in absolute value) of this generating set are bounded away uniformly from one). We prove a (nearly sharp) bound on the distribution of dimensions of irreducible...
متن کاملDeconstructing 1-local expanders
Contemplating the recently announced 1-local expanders of Viola and Wigderson (ECCC, TR16-129, 2016), one may observe that weaker constructs are well know. For example, one may easily obtain a 4-regular N -vertex graph with spectral gap that is Ω(1/ logN), and similarly a O(1)-regular N -vertex graph with spectral gap 1/Õ(logN). Starting from a generic candidate for a 1-local expander, we formu...
متن کاملExpanders via Local Edge Flips
Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an n-node d-regular network for d = Ω(log n), we want to design a decentralized, local algorithm that transforms the graph into one that has good connectivity properties (low diameter, expansion, etc.) withou...
متن کاملLocal Improvement Gives Better Expanders
It has long been known that random regular graphs are with high probability good expanders. This was first established in the 1980s by Bollobás by directly calculating the probability that a set of vertices has small expansion and then applying the union bound. In this paper we improve on this analysis by relying on a simple high-level observation: if a graph contains a set of vertices with sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2021
ISSN: ['1661-7207', '1661-7215']
DOI: https://doi.org/10.4171/ggd/610